High-Quality Polygonal Contour Approximation Based on Relaxation

نویسندگان

  • Artem Mikheev
  • Luc Vincent
  • Vance Faber
چکیده

An algorithm is proposed for extracting high quality polygonal contours from connected objects in binary images. This is can be useful for OCR algorithms working on scanned text. It is also particularly interesting for raster-to-vector conversion of engineering drawings or other types of line drawings, where simple contours (known as Freeman chains) are grossly inadequate. Our algorithm is based on a relaxation technique, in which an initial polygonal approximation is iteratively re ned until stability. Experiments demonstrate that this method consistently produces high quality results: the polygonal approximations obtained have a minimal number of corner points and remain extremely close to the original Freeman chain code.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Contour polygonal approximation using shortest path in networks

Contour polygonal approximation is a simplified representation of a contour by line segments, so that the main characteristics of the contour remain in a small number of line segments. This paper presents a novel method for polygonal approximation based on the Complex Networks theory. We convert each point of the contour into a vertex, so that we model a regular network. Then we transform this ...

متن کامل

Polygonal approximation of digital planar curves through adaptive optimizations

In this paper, we present a novel non-parametric polygonal approximation algorithm for digital planar curves. The proposed algorithm first selects a set of points (called cut-points) on the contour which are of very ‘high’ curvature. An optimization procedure is then applied to find adaptively the best fitting polygonal approximations for the different segments of the contour as defined by the ...

متن کامل

A Supervised Shape Classification Technique Invariant under Rotation and Scaling

In this paper, we propose a new object classification technique based on polygonal approximation of the open profile of object. The vertices of polygonal approximation are formed by high curvature points of the profile and they are selected by Fourier transform of the object contour. A series of features are computed from the polygonal approximation and then the minimum distance classifier is u...

متن کامل

Polygonal approximation using integer particle swarm optimization

Polygonal approximation is an effective yet challenging digital curve representation for image analysis, pattern recognition and computer vision. This paper proposes a novel approach, integer particle swarm optimization (iPSO), for polygonal approximation. When compared to the traditional binary version of particle swarm optimization (bPSO), the new iPSO directly uses an integer vector to repre...

متن کامل

Survey on Polygonal Approximation Techniques for Digital Planar Curves

Polygon approximation plays a vital role in abquitious applications like multimedia, geographic and object recognition. An extensive number of polygonal approximation techniques for digital planar curves have been proposed over the last decade, but there are no survey papers on recently proposed techniques. Polygon is a collection of edges and vertices. Objects are represented using edges and v...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2001